Avoiding Tests for Subsum
نویسندگان
چکیده
Useful equivalence-preserving operations based on unfilinks are described. These operations eliminate a potentially large number of subsumed paths in a negation normal form formula. Those anti-links that directly indicate the presence of subsumed paths are characterized. These operations are useful for prime implicant/implicate algorithms because most of the computational effort in computing the prime implicants and prime implicates of a propositional formula is spent on subsumption checks. The problem of removing all subsumed paths in an NNF formula is shown to be NP-hard, even though such formulas may be small relative to the size of their path sets. The general problem of determining whether a pair of subsumed paths is associated with an arbitrary anti-link is shown to be NP-complete. Further reductions of subsumption checks are shown to be available when strictly put-e full blocks are present. The effectiveness of operations based on anti-links and strictly pure full blocks is examined with respect to some benchmark examples from the literature.
منابع مشابه
A Subjective Logic Framework for Multi-Document Summarization
In this paper we propose SubSum, a subjective logic framework for sentence-based extractive multi-document summarization. Document summaries perceived by humans are subjective in nature as human judgements of sentence relevancy are inconsistent and laden with uncertainty. SubSum captures this uncertainty and extracts significant sentences from a document cluster to generate extractive summaries...
متن کاملSubcortical Vascular Cognitive Impairment staged through cdr's functional subsum (cdr-func): Preliminary results from an outpatient sample☆☆☆
Background Staging vascular cognitive impairment (VCI) might be useful for sample selection in clinical trials and for guiding clinical decision-making. Clinical dementia rating (CDR) has been applied for staging cognitive impairments of different etiologies, but it may underestimate severity of non-Alzheimer's disease cognitive deficits. Methods Out of a total of 147 elderly subjects, 23 (me...
متن کاملOn Sets Represented by Partitions
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.
متن کاملLong arithmetic progressions in sum-sets and the number of x-sum-free sets
In this paper we obtain optimal bounds for the length of the longest arithmetic progression in various kinds of sum-sets. As an application, we derive a sharp estimate for the number of sets A of residues modulo a prime n such that no subsum of A equals x modulo n, where x is a fixed residue modulo n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999